Workflow Flexibility by Deviation by means of Constraint Satisfaction Problem Solving
نویسندگان
چکیده
This paper introduces a novel approach for flexible workflow management by applying constraint satisfaction problem solving. This enables us to support workflow deviations at runtime, react to upcoming events or unpredictable circumstances, but still support the user through worklist suggestions. The developed workflow engine is completely based on declarative workflow representations, whereas procedural languages are used for workflow modeling.
منابع مشابه
A New Method for Solving Constraint Satisfaction Problems
Many important problems in Artificial Intelligence can be defined as Constraint Satisfaction Problems (CSP). These types of problems are defined by a limited set of variables, each having a limited domain and a number of Constraints on the values of those variables (these problems are also called Consistent Labeling Problems (CLP), in which “Labeling" means assigning a value to a variable.) Sol...
متن کاملA New Method for Solving Constraint Satisfaction Problems
Many important problems in Artificial Intelligence can be defined as Constraint Satisfaction Problems (CSP). These types of problems are defined by a limited set of variables, each having a limited domain and a number of Constraints on the values of those variables (these problems are also called Consistent Labeling Problems (CLP), in which “Labeling means assigning a value to a variable.) Solu...
متن کاملSupporting Collaboration Through Semantic-Based Workflow and Constraint Solving
This paper describes our efforts to provide a collaborative problem solving architecture driven by semantic-based workflow orchestration and constraint problem solving. These technologies are based on a shared ontology that allows two open systems of very different natures to communicate, perform specialised tasks and achieve common goals. We give an account of our approach and the semantic bas...
متن کاملCSAA: a Constraint Satisfaction Ant Algorithm Framework
In this paper the Constraint Satisfaction Ant Algorithm (CSAA) framework is presented. The underlying infrastructure and the ants behavior are described in detail. The CSAA framework is an ant-based system for solving discrete Constraint Satisfaction Problems (CSP) and Partial Constraint Satisfaction Problems (PCSP). CSPs and PCSPs are used among others to design facility layouts and schedule w...
متن کاملThe Capacitated Location-Allocation Problem with Interval Parameters
In this paper, we develop a capacitated location-covering model considering interval values for demand and service parameters. We also consider flexibility on distance standard for covering demand nodes by the servers. We use the satisfaction degree to represent the constraint of service capacity. The proposed model belongs to the class of mixed integer programming models. Our model can be redu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017